Pointwise-recurrent maps on uniquely arcwise connected locally arcwise connected spaces

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Colouring Arcwise Connected Sets in the Plane II

Let G be the family of nite collections S where S is a collection of closed, bounded, arcwise connected sets in R 2 which for any S; T 2 S where S \ T 6 = ;, it holds that S \ T is arcwise connected. Given S 2 G which is triangle-free, we show that provided S is suu-ciently large there exists a subcollection S 0 S of at most 5 sets with the property that the sets of S surrounded by S 0 induce a...

متن کامل

Arcwise Connectedness of the Boundaries of Connected Self-similar Sets

Let T be the attractor of injective contractions f1, . . . , fm on R 2 that satisfy the Open Set Condition. If T is connected, ∂T is arcwise connected. In particular, the boundary of the Lévy dragon is arcwise connected.

متن کامل

Colouring Arcwise Connected Sets in the Plane I

Let G be the family of ®nite collections S where S is a collection of bounded, arcwise connected sets in R which for any S;T A S where S VT 0h, it holds that S VT is arcwise connected. We investigate the problem of bounding the chromatic number of the intersection graph G of a collection S A G. Assuming G is triangle-free, suppose there exists a closed Jordan curve C HR such that C intersects a...

متن کامل

Locally Connected Recurrent Networks

The fully connected recurrent network (FRN) using the on-line training method, Real Time Recurrent Learning (RTRL), is computationally expensive. It has a computational complexity of O(N 4) and storage complexity of O(N 3), where N is the number of non-input units. We have devised a locally connected recurrent model which has a much lower complexity in both computational time and storage space....

متن کامل

Optimality for Multi-Objective Programming Involving Arcwise Connected d-Type-I Functions

This paper deals with the optimality conditions and dual theory of multi-objective programming problems involving generalized convexity. New classes of generalized type-I functions are introduced for arcwise connected functions, and examples are given to show the existence of these functions. By utilizing the new concepts, several sufficient optimality conditions and Mond-Weir type duality resu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2015

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-2015-12589-0